Aiaa-2000-4919 Voronoi Diagram Based Cumulative Approximation for Engineering Optimization

نویسندگان

  • Kikuo Fujita
  • Noriyasu Hirokawa
  • Tomoya Tachikawa
چکیده

This paper proposes a function approximation scheme based on Voronoi diagram, a technique of computational geometry, toward optimization cost saving in real engineering applications. The scheme consists of a blending function of local information over spatial structure among sample points that is topologically represented with Voronoi diagram, an estimation method of function gradients through the method of least squares along each Voronoi region, and an associated overall optimization algorithm. The scheme can locally establish and cumulatively update an approximation function based on the nature of Voronoi diagram, and this leads efficient and accurate accumulation of samples toward superior global fidelity in function approximation. Its validity and advantages are demonstrated through its application to a twodimensional example problem and a welded beam structure design problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Potential Role of Cache Mechanism for Complicated Design Optimization

This paper discusses the potential role of cache mechanism for complicated design optimization. While design optimization is an application of mathematical programming techniques to engineering design problems over numerical computation, its progress has been coevolutionary. The trend in such progress indicates that more complicated applications become the next target of design optimization bey...

متن کامل

Approximation of a Spherical Tessellation by the Laguerre Voronoi Diagram

This paper presents a method for approximating spherical tessellations, the edges of which are geodesic arcs, using spherical Laguerre Voronoi diagrams. The approximation method involves fitting the polyhedron corresponding to the spherical Laguerre Voronoi diagram to the observed tessellation using optimization techniques.

متن کامل

Hierarchical Data Representations Based on Planar Voronoi Diagrams

Multiresolution representation of high-dimensional scattered data is a fundamental problem in scientific visualization. This paper introduces a data hierarchy of Voronoi diagrams as a versatile solution. Given an arbitrary set of points in the plane, our goal is the construction of an approximation hierarchy using the Voronoi diagram as the essential building block. We have implemented two Voro...

متن کامل

Lloyd relaxation using analytical Voronoi diagram in the L ∞ norm and its application to quad optimization

An incremental Delaunay triangulation algorithm to generate Voronoi diagrams within the L∞ norm is presented. The main qualities are the preservation of the simplicity of the classical L2 version and its its intrinsic robustness It is then coupled to the well known Lloyd algorithm for computing Centroidal Voronoi Tesselations of point sets. This algorithm is then used to generate well shaped qu...

متن کامل

Geometry and Combinatorics of the Cutting Angle Method

Lower approximation of Lipschitz functions plays an important role in deterministic global optimization. This article examines in detail the lower piecewise linear approximation which arises in the cutting angle method. All its local minima can be explicitly enumerated, and a special data structure was designed to process them very efficiently, improving previous results by several orders of ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000